A Solution for the Quadratic Assignment Problem (QAP) through a Parallel Genetic Algorithm Based Grid on GPU
نویسندگان
چکیده
The QAP is considered one of the most complex combinatorial optimization problems and it is the model for many real life problems such as facilities location, camp planning, computer keyboard design and electronic boards cabling, among other applications. This Paper solves some significant instances of this problem through an improved Parallel Genetic Algorithm based Grid by means of the local heuristics search 2-opt on Graphics Processing Units (GPU’s).
منابع مشابه
A Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA GPU implementation of the Simulated Annealing Heuristic for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. An effective heuristic for obtaining approximate solutions to the QAP is simulated annealing (SA). Here we describe an SA implementation for the QAP which runs on a graphics processing unit (GPU). GPUs are composed of low cost commodity graphics chips which in combination provide a powerful ...
متن کاملA QAP Solver with CUDA GPU Computing Architecture A Two Page Description of the Application Submitted for GECCO 2009 Competition : GPUs for Genetic and Evolutionary Computation
This application solves the quadratic assignment problem (QAP) [1]. In QAP, we are given l locations and l facilities and the task is to assign the facilities to the locations to minimize the cost. We chose QAP for the following reasons: First, problem sizes of QAPs in real life problems are relatively small compared with other problems in permutation domains such as the traveling salesman prob...
متن کاملA Solution Method for the Quadratic Assignment Problem (QAP)
The classic Quadratic Assignment Problem (QAP) is one of the most interesting and challenging combinatorial optimization problems in existence. Since QAP is NP-complete, it is notoriously difficult to be solved by exact solution methods. This paper focuses on the intelligent solution methods, particularly, genetic algorithms, and related development on QAP. A hybrid genetic algorithm is devised...
متن کاملRlt2-based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
This paper discusses efficient parallel algorithms for obtaining strong lower bounds and exact solutions for large instances of the Quadratic Assignment Problem (QAP). Our parallel architecture is comprised of both multi-core processors and Compute Unified Device Architecture (CUDA) enabled NVIDIA Graphics Processing Units (GPUs) on the Blue Waters Supercomputing Facility at the University of I...
متن کامل